Inapproximability of Orthogonal Compaction
نویسندگان
چکیده
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in polynomial time unless P = NP. We also provide a fixed-parameter-tractable algorithm for testing whether a drawing can be compacted to a small number of rows. Submitted: November 2011 Reviewed: February 2012 Revised: February 2012 Accepted: February 2012 Final: March 2012 Published: September 2012 Article type: Regular paper Communicated by: M. van Kreveld and B. Speckmann This work was supported in part by NSF grant 0830403 and by the Office of Naval Research under grant N00014-08-1-1015. A previous version of this paper appeared in the International Symposium on Graph Drawing 2011. E-mail addresses: [email protected] (Michael J. Bannister) [email protected] (David Eppstein) [email protected] (Joseph A. Simons) 652 Bannister, Eppstein, Simons Compaction for Graph Drawings
منابع مشابه
Orthogonal Compaction using Additional Bends
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing...
متن کاملA novel method for designing adaptive compaction orthogonal wavelet filter banks
Recently, there has k e n a growing interest in investigating signal-adaptive multirate filter banks. I n this paper, we propose a direct method of constructing signal-adaptive orthogonal wavelet filter banks with better energy compaction performance than that of Daubechies wavelet filters of same length. 'The speed of this method is fast. so i t can be constructed in real time.
متن کاملExperiments on Area Compaction Algorithms for Orthogonal Drawings
This paper presents an experimental study on several compaction algorithms for orthogonal drawings of graphs. We concentrate on algorithms that minimize the area, and compare them with other representative compaction algorithms in the state of the art. In particular, we propose a new exact algorithm that minimizes the total edge length subject to the optimization of the area, and experimentally...
متن کاملA Crystal Plasticity View of Powder Compaction
The cold compaction of an aggregate of powder is treated from the viewpoint of crystal plasticity theory. The contacts between particles are treated as compaction planes which yield under both normal and shear straining. The hardening of each plane represents both geometric and material hardening at the contacts between particles; the macroscopic tangent stiffness can be written in terms of the...
متن کاملSpace compaction of test responses using orthogonal transmission functions [logic testing]
Space compaction of test responses provides parallel access to functional outputs and reduces testing time and test data volume. We present a new space compaction approach that only uses information about the fault-free responses for a precomputed test set . It is, therefore, especially suitable for embedded cores. It does not make any assumption about an underlying fault model, and it does not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 16 شماره
صفحات -
تاریخ انتشار 2012